Sequentially Complete Inductive Limits and Regularity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sequentially Retractive Inductive Limits

Every locally complete inductive limit of sequentially complete locally convex spaces , which satisfies Retakh's condition (M) is regular, sequentially complete and sequentially retractive. A quasiconverse for this theorem and a criterion for sequential retractivity of inductive limits of webbed spaces are given.

متن کامل

On sequentially h-complete groups

A topological group G is sequentially h-complete if all the continuous homomorphic images of G are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the language of sequential h-completeness. In the process of obtaining such conditions, we establish a structure theorem for ω-precompact sequentially h-complete groups. As...

متن کامل

Sequentially Cohen-macaulay Bipartite Graphs: Vertex Decomposability and Regularity

Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be determined from the invariants of G.

متن کامل

Sequential Completeness of Inductive Limits

A regular inductive limit of sequentially complete spaces is sequentially complete. For the converse of this theorem we have a weaker result: if indEn is sequentially complete inductive limit, and each constituent space En is closed in indEn, then indEn is α-regular.

متن کامل

Weak regularity and finitely forcible graph limits

Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many subgraph densities, has a simple structure. In particular, one of their conjectures would imply that every finitely forcible graphon has a weak ε-regular partition with the number of parts bounded b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 2004

ISSN: 0011-4642,1572-9141

DOI: 10.1007/s10587-004-6418-4